ILP-Based Local Search for Graph Partitioning
نویسندگان
چکیده
منابع مشابه
ILP-based Local Search for Graph Partitioning
Computing high-quality graph partitions is a challenging problem with numerous applications. In this paper, we present a novel meta-heuristic for the balanced graph partitioning problem. Our approach is based on integer linear programs that solve the partitioning problem to optimality. However, since those programs typically do not scale to large inputs, we adapt them to heuristically improve a...
متن کاملA Graph-Partitioning Based Approach for Parallel Best-First Search
Parallel best-first search algorithms such as HDA* distribute work among the processes using a global hash function. Previous work distribution strategies seek to find a good walltime efficiency by reducing search overhead and/or communication overhead, but there was no unified, quantitative analysis on the effects of the methods on both overheads. We propose GRAZHDA*, a graph-partitioning base...
متن کاملMultilevel Reactive Tabu Search for Graph Partitioning
In this paper, new multilevel heuristics are proposed for nding a balanced bipartition of a graph. Multilevel schemes have been recently introduced for quickly solving the problem on graphs with thousands of nodes, graphs often present in domain-decomposition techniques for parallel computing. These heuristics rstly reduce the original graph by collapsing its nodes and arcs, thus generating a h...
متن کاملGraph Partitioning Using Tabu Search
In this paper, we present another approach to the balanced minimum cut graph partitioning problem. This approach is based on the meta-heuristic known as tabu search. Our experimental results compare favorably with two of the most effecitive methods available in terms of quality of solutions and computational times. Our experience and experiments suggest that this technique can be applied effect...
متن کاملA Hybrid Genetic Search for Multi way Graph Partitioning Based on Direct Partitioning
Multi way partitioning is an important ex tension of two way partitioning as it provides a natural and direct model for many parti tioning applications In this paper we pro pose a hybrid genetic algorithm for k way partitioning The algorithm includes an ef cient local optimization heuristic which is not based on the bisection method It con siderably outperformed existing k way parti tioning alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2020
ISSN: 1084-6654,1084-6654
DOI: 10.1145/3398634